CoQuiAAS: Application of Constraint Programming for Abstract Argumentation
نویسندگان
چکیده
This paper is a description of our proposal to use Constraint Programming techniques to develop a software library dedicated to argumentative reasoning. We present a library which offers the advantages to be generic and easily adaptable.
منابع مشابه
ConArg2: A Constraint-based Tool for Abstract Argumentation
Argumentation Stefano Bistarelli, Fabio Rossi, Francesco Santini 1 Dipartimento di Matematica e Informatica, Università di Perugia [bista,rossi]@dmi.unipg.it 2 Istituto di Informatica e Telematica, CNR, Pisa [email protected] Abstract. ConArg2 is a Constraint-programming tool oriented to the solution of problems related to extension-based semantics in Abstract Argumentation. It explo...
متن کاملConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints
ConArg is a Constraint Programming-based tool that can be used to model and solve different problems related to Abstract Argumentation Frameworks (AFs). To implement this tool we have used JaCoP, a Java library that provides the user with a Finite Domain Constraint Programming paradigm. ConArg is able to randomly generate networks with small-world properties in order to find conflict-free, admi...
متن کاملA ConArg-based Library for Abstract Argumentation
We present ConArgLib, a C++ library implemented to help programmers solve some of the most important problems related to extension-based Abstract Argumentation. The library is based on ConArg, which exploits Constraint Programming and, in particular, Gecode, a toolkit for developing constraint-based systems and applications. Given a semantics, such problems consist, for example, in enumerating ...
متن کاملRepresenting Argumentation Schemes with Constraint Handling Rules (CHR)
We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentation schemes in informal logic and philosophy, and serve as executable specifications for automatically constructing arguments, when applied to a set of assumptions. Since argumenta...
متن کاملAbstract Solvers for Answer Set Programming
Solvers for Answer Set Programming Marco Maratea Universita’ degli Studi di Genova, Italy (e-mail: [email protected]) Abstract Abstract solvers are a recently employed method to formally describe, compare and combine solving algorithms, where the states of computation are represented as nodes of a graph, the solving techniques as edges between such nodes, the solving process as a path in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015